- longest processing time
- Quality control: LPT
Универсальный русско-английский словарь. Академик.ру. 2011.
Универсальный русско-английский словарь. Академик.ру. 2011.
Longest increasing subsequence — The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not… … Wikipedia
Dead time — For other uses, see Dead Time (disambiguation). For detection systems that record discrete events, such as particle and nuclear detectors, the dead time is the time after each event during which the system is not able to record another event.[1]… … Wikipedia
Transparallel processing — is a form of processing, in computing or otherwise, in which items are processed simultaneously by one processor.Transparallel processing complements the three forms of processing called: * subserial processing, in which items are processed one… … Wikipedia
Real time database — A real time database is a processing system designed to handle workloads whose state is constantly changing (Buchmann). This differs from traditional databases containing persistent data, mostly unaffected by time. For example, a stock market… … Wikipedia
Natural language processing — (NLP) is a field of computer science and linguistics concerned with the interactions between computers and human (natural) languages; it began as a branch of artificial intelligence.[1] In theory, natural language processing is a very attractive… … Wikipedia
Real-time operating system — A real time operating system (RTOS; generally pronounced as are toss ) is a multitasking operating system intended for real time applications. Such applications include embedded systems (programmable thermostats, household appliance controllers,… … Wikipedia
Liming (leather processing) — The liming operation in leather, is a drum/paddle or pit based operation where four main objectives are met. The obectives are [citation title = Leather Technician s Handbook first = J.H. | last = Sharphouse page = 104 publisher = Leather… … Wikipedia
dispatching rules — Rules used to decide the priorities for fulfilling orders. Examples include: • first come first served (FCFS); • first in first out (FIFO) often seen as a fair rule, especially by the customer, but in practice it leads to overall inefficiency; •… … Big dictionary of business and management
Multiprocessor scheduling — In computer science, multiprocessor scheduling is an NP complete optimization problem. The problem statement is: Given a set J of jobs where job ji has length li and a number of processors mi, what is the minimum possible time required to… … Wikipedia
List scheduling — The basic idea of list scheduling is to make an ordered list of processes by assigning them some priorities, and then repeatedly execute the following two steps until a valid schedule is obtained : * Select from the list, the process with the… … Wikipedia
Radix sort — In computer science, radix sort is a sorting algorithm that sorts integers by processing individual digits. Because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is… … Wikipedia